A Fast Multifrontal Solver for Non-linear Multi-physics Problems
نویسندگان
چکیده
MIUR Center for Science and Application of Advanced Computing Paradigms at the University of Padova, Italy Consorzio Roma Ricerche Roma, Italy International Centre for Mechanical Sciences, Udine, Italy Ente per le Nuove tecnologie, l’Energia e l’Ambiente, Roma, Italy Department of Information Engineering University of Padova, Italy ? IBM Power3@375MHz with 4 GB mem ? HPM Toolkit for performance measurements ? FE square meshes with 100, 400, 625, and 2500 square 8-node elements ? PMMS is our multifrontal solver ? SuperLU version 3.0 ? MUMPS version 4.3 Assembly phase Ia.
منابع مشابه
Superfast Multifrontal Method for Large Structured Linear Systems of Equations
In this paper we develop a fast direct solver for large discretized linear systems using the supernodal multifrontal method together with low-rank approximations. For linear systems arising from certain partial differential equations such as elliptic equations, during the Gaussian elimination of the matrices with proper ordering, the fill-in has a low-rank property: all off-diagonal blocks have...
متن کاملSuperfast Multifrontal Method for Structured Linear Systems of Equations
In this paper we develop a fast direct solver for discretized linear systems using the multifrontal method together with low-rank approximations. For linear systems arising from certain partial differential equations such as elliptic equations we discover that during the Gaussian elimination of the matrices with proper ordering, the fill-in has a low-rank property: all off-diagonal blocks have ...
متن کاملAn efficient multi-core implementation of a novel HSS-structured multifrontal solver using randomized sampling
We present a sparse linear system solver that is based on a multifrontal variant of Gaussian elimination, and exploits low-rank approximation of the resulting dense frontal matrices. We use hierarchically semiseparable (HSS) matrices, which have low-rank off-diagonal blocks, to approximate the frontal matrices. For HSS matrix construction, a randomized sampling algorithm is used together with i...
متن کاملA fast direct solver for elliptic problems on Cartesian meshes in 3D
We present a fast direct algorithm for solutions to linear systems arising from three dimensional elliptic equations. We follow the approach of Xia et al. (2009) on combining the multifrontal method with hierarchical matrices in two dimensions and extend it to three dimensional case. Linear time complexity is shown and a more practical variant with worse scaling is demonstrated.
متن کاملNUMERICAL ANALYSIS GROUP PROGRESS REPORT January 1994 – December 1995
2 Sparse Matrices ……………………………………………………………………………… 4 2.1 The direct solution of sparse unsymmetric linear sets of equations (I.S. Duff and J.K. Reid) …………………………………………………………………………… 4 2.2 The design and use of algorithms for permuting large entries to the diagonal 2.6 Element resequencing for use with a multiple front solver (J. A. Scott) ………… 10 2.7 Exploiting zeros on the diagonal in the direct s...
متن کامل